Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks
نویسنده
چکیده
An unpaired many-to-many -disjoint path cover (-DPC) of a graph is a set of disjoint paths joining distinct sources and sinks in which each vertex of is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every -dimensional restricted HL-graph, ≥ , with or less faulty elements (vertices and/or edges) has an unpaired many-to-many -DPC for any ≥ and ≥ with ≤ .
منابع مشابه
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
A Disjoint Path Cover (DPC for short) of a graph is a set of pairwise (internally) disjoint paths that altogether cover every vertex of the graph. Given a set S of k sources and a set T of k sinks, a many-to-many k-DPC between S and T is a disjoint path cover each of whose paths joins a pair of source and sink. It is classified as paired if each source of S must be joined to a designated sink o...
متن کاملMany-to-many two-disjoint path covers in cylindrical and toroidal grids
A many-to-many k-disjoint path cover of a graph joining two disjoint vertex sets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. The many-to-many k-disjoint path cover is classified as paired if each source in S is further required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we first ...
متن کاملOre-type degree conditions for disjoint path covers in simple graphs
A many-to-many k-disjoint path cover of a graph joining two disjoint vertex subsets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. It is classified as paired if each source in S is required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we develop Ore-type sufficient conditions for the ...
متن کاملAlgorithms for finding disjoint path covers in unit interval graphs
A many-to-many k-disjoint path cover (k-DPC for short) of a graph G joining the pairwise disjoint vertex sets S and T , each of size k, is a collection of k vertex-disjoint paths between S and T , which altogether cover every vertex of G. This is classified as paired, if each vertex of S must be joined to a specific vertex of T , or unpaired, if there is no such constraint. In this paper, we de...
متن کاملGeneral-demand disjoint path covers in a graph with faulty elements
A k-disjoint path cover of a graph is a set of k internally vertex-disjoint paths which cover the vertex set with k paths and each of which runs between a source and a sink. Given that each source and sink v is associated with an integer-valued demand d(v) ≥ 1, we are concerned with general-demand k-disjoint path cover in which every source and sink v is contained in the d(v) paths. In this pap...
متن کامل